Propositional Logic Card GamesSHIVER, Anthony.Teaching philosophy. 2013, Vol 36, Num 1, pp 51-58, issn 0145-5788, 8 p.Article

Markov's principle for propositional type theoryKOPYLOV, Alexei; NOGIN, Aleksey.Lecture notes in computer science. 2001, pp 570-584, issn 0302-9743, isbn 3-540-42554-3Conference Paper

How to change factual beliefs using laws and dependence informationHERZIG, A.Lecture notes in computer science. 1997, pp 311-321, issn 0302-9743, isbn 3-540-63095-3Conference Paper

(IN)Effectiveness of look-ahead techniques in a modern SAT solverGIUNCHIGLIA, Enrico; MARATEA, Marco; TACCHELLA, Armando et al.Lecture notes in computer science. 2003, pp 842-846, issn 0302-9743, isbn 3-540-20202-1, 5 p.Conference Paper

The syntax versus semantics debate revisited?CLARK, P.Computational intelligence. 1993, Vol 9, Num 4, pp 366-367, issn 0824-7935Article

The independence of Peano's fourth axiom from Martin-Löf's type theory without universesSMITH, J. M.The Journal of symbolic logic. 1988, Vol 53, Num 3, pp 840-845, issn 0022-4812Article

The effect of nogood recording in DPLL-CBJ SAT algorithmsLYNCE, Ines; MARQUES-SILVA, Joao.Lecture notes in computer science. 2003, pp 144-158, issn 0302-9743, isbn 3-540-00986-8, 15 p.Conference Paper

Intention and rationality for PRS-like agentsWOBCKE, Wayne.Lecture notes in computer science. 2002, pp 167-178, issn 0302-9743, isbn 3-540-00197-2, 12 p.Conference Paper

Efficient detection of vacuity in ACTL formulasBEER, I; BEN-DAVID, S; EISNER, C et al.Lecture notes in computer science. 1997, pp 279-290, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Decision procedures for logics of consequential implicationPIZZI, C.Notre Dame journal of formal logic. 1991, Vol 32, Num 4, pp 618-636, issn 0029-4527Article

Fusion by weakeningGREGOIRE, Eric.SPIE proceedings series. 2003, pp 251-255, isbn 0-8194-4959-8, 5 p.Conference Paper

Logical reasoning and Petri NetsLAUTENBACH, Kurt.Lecture notes in computer science. 2003, pp 276-295, issn 0302-9743, isbn 3-540-40334-5, 20 p.Conference Paper

SATO : An efficient propositional proverZHANG, H.Lecture notes in computer science. 1997, pp 272-275, issn 0302-9743, isbn 3-540-63104-6Conference Paper

The undecidability of second order multiplicative linear logicLAFONT, Y; SCEDROV, A.Information and computation (Print). 1996, Vol 125, Num 1, pp 46-51, issn 0890-5401Article

F≤ with recursive types : types-as-propositions interpretation in M. Rabin's S2SVorobyov, Sergei.1994, 16 p.Report

Gentzen-type axiomatization for PALWALUKIEWICZ, I.Theoretical computer science. 1993, Vol 118, Num 1, pp 67-79, issn 0304-3975Conference Paper

The undecidability of propositional temporal logic for Petri netsCHERKASOVA, L. A; KOTOV, V. E.Computers and artificial intelligence. 1987, Vol 6, Num 2, pp 123-130, issn 0232-0274Article

An Automated Derivation of Church's P₂ Sentential Calculus from Łukasiewicz's CNHORNER, Jack K.Artificial intelligence. International conferenceWorldComp'2011. 2011, pp 179-185, isbn 1-60132-183-X 1-60132-184-8 1-60132-185-6, 7 p.Conference Paper

An Automated Derivation of Łukasiewicz's CN from Frege's Sentential CalculusHORNER, Jack K.Artificial intelligence. International conferenceWorldComp'2011. 2011, pp 217-221, isbn 1-60132-183-X 1-60132-184-8 1-60132-185-6, 5 p.Conference Paper

SAT : Spatial awareness from textual inputKALASHNIKOV, Dmitri V; YIMING MA; MEHROTRA, Sharad et al.Lecture notes in computer science. 2006, pp 1159-1163, issn 0302-9743, isbn 3-540-32960-9, 1Vol, 5 p.Conference Paper

An algorithm for SAT above the thresholdHUBIE CHEN.Lecture notes in computer science. 2004, pp 14-24, issn 0302-9743, isbn 3-540-20851-8, 11 p.Conference Paper

Atomic cut elimination for classical logicBRÜNNLER, Kai.Lecture notes in computer science. 2003, pp 86-97, issn 0302-9743, isbn 3-540-40801-0, 12 p.Conference Paper

Structure theorems for closed sets of implicates/implicants in temporal logicDE GUZMAN, I. P; CORDERO, P; ENCISO, M et al.Lecture notes in computer science. 1999, pp 193-207, issn 0302-9743, isbn 3-540-66548-XConference Paper

An arithmetical ompleteness theorem for pre-permutationsTUTTAS, F.Notre Dame journal of formal logic. 1993, Vol 34, Num 1, pp 84-89, issn 0029-4527Article

On the restricted equivalence for subclasses of propositional logicFLÖGEL, A; KLEINE BÜNING, H; LETTMANN, T et al.Informatique théorique et applications (Imprimé). 1993, Vol 27, Num 4, pp 327-340, issn 0988-3754Article